Preconditioning Techniques Based on the Birkhoff-von Neumann Decomposition
نویسندگان
چکیده
We introduce a class of preconditioners for general sparsematrices based on the Birkhoff–von Neumann decomposition of doubly stochastic matrices. These preconditioners are aimed primarily at solving challenging linear systems with highly unstructured and indefinite coefficient matrices. We present some theoretical results and numerical experiments on linear systems from a variety of applications.
منابع مشابه
Minimum Birkhoff-von Neumann Decomposition
Motivated by the applications in routing in data centers, we study the problem of expressing an n × n doubly stochastic matrix as a linear combination using the smallest number of (sub)permutation matrices. The Birkhoff-von Neumann decomposition theorem proves that there exists such a decomposition, but does not give a representation with the smallest number of permutation matrices. In particul...
متن کاملBirkhoff-von Neumann switching with statistical traffic profiles
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix K 1⁄4 ðkijÞ, Birkhoff-von Neumann decomposition offers a quasi-offline scheduling strategy that can provide a service rate of at least kij for each flow ði; jÞ without internal speedup. This paper extends the Birkhoff-von Neum...
متن کاملBirkhoff-von-Neumann Switches with Deflection-Compensated Mechanism
Despite the high throughput and low complexity achieved by input scheduling based on Birkhoff-von-Neumann (BvN) decomposition; the performance of the BvN switch becomes less predictable when the input traffic is bursty. In this paper, we propose a deflection-compensated BvN (D-BvN) switch architecture to enhance the quasi-static scheduling based on BvN decomposition. The D-BvN switches provide ...
متن کاملOn Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neumann
Based on a decomposition result by Birkhoff and von Neumann for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling ...
متن کاملA Short Proof of the Birkhoff-von Neumann Theorem
The Birkhoff-von Neumann Theorem has been proved many times in the literature with a number of different methods, some inductive, some constructive, some existential. We offer a new proof that is a little more direct than most, though nonconstructive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Meth. in Appl. Math.
دوره 17 شماره
صفحات -
تاریخ انتشار 2017